Arc Segmentation in Linear Time
نویسندگان
چکیده
A linear algorithm based on a discrete geometry approach is proposed for the detection of digital arcs and digital circles using a new representation of them. It is introduced by inspiring from the work of Latecki [1]. By utilizing this representation, we transform the problem of digital arc detection into a problem of digital straight line recognition. We then develop a linear method for arc segmentation of digital curves.
منابع مشابه
A linear method for segmentation of digital arcs
A linear algorithm based on a discrete geometry approach is proposed for the recognition of digital arcs and digital circles using a new representation of them. By utilizing this representation, we transform the problem of digital arc recognition into the problem of digital straight line recognition. We then develop a linear method for the segmentation of digital arcs. In addition, the proposed...
متن کاملRecognition-based handwritten Chinese character segmentation using a probabilistic Viterbi algorithm
This paper presents a recognition-based character segmentation method for handwritten Chinese characters. Possible non-linear segmentation paths are initially located using a probabilistic Viterbi algorithm. Candidate segmentation paths are determined by verifying overlapping paths, between-character gaps, and adjacent-path distances. A segmentation graph is then constructed using candidate pat...
متن کاملA System for Performance Evaluation of Arc Segmentation Algorithms
Accurate segmentation of circular arcs from line drawings is essential for higher level processing in document analysis and recognition systems. In spite of the prevalence of arc segmentation methods, robust algorithms that perform well in complex graphic environments are scarce, and methods to evaluate such algorithms are even more rare. Extending our previous work, we propose a comprehensive ...
متن کاملFinal Report of GREC'13 Arc and Line Segmentation Contest
Recognition of geometric primitives such as line and arc helps in automatic conversion of line drawing document images into electronic form. A large number of raster to vector methods can be found in the literature. A line and arc segmentation contest was held in conjunction with the tenth IAPR International Workshop on Graphics Recognition (GREC 2013) for comparing performance of different met...
متن کاملOptimal Graph Search Segmentation Using Arc-Weighted Graph for Simultaneous Surface Detection of Bladder and Prostate
We present a novel method for globally optimal surface segmentation of multiple mutually interacting objects, incorporating both edge and shape knowledge in a 3-D graph-theoretic approach. Hard surface interacting constraints are enforced in the interacting regions, preserving the geometric relationship of those partially interacting surfaces. The soft smoothness a priori shape compliance is in...
متن کامل